Robustness and tuning of on-line optimizing control algorithms
نویسندگان
چکیده
منابع مشابه
A Note on Parameter Tuning for On-line Shifting Algorithms
In this short note, building on ideas of M. Herbster [2] we propose a method for automatically tuning the parameter of the FIXEDSHARE algorithm proposed by Herbster and Warmuth [3] in the context of on-line learning with shifting experts. We show that this can be done with a memory requirement of O(nT ) and that the additional loss incurred by the tuning is the same as the loss incurred for est...
متن کاملEfficient and Robust Parameter Tuning for Heuristic Algorithms
The main advantage of heuristic or metaheuristic algorithms compared to exact optimization methods is their ability in handling large-scale instances within a reasonable time, albeit at the expense of losing a guarantee for achieving the optimal solution. Therefore, metaheuristic techniques are appropriate choices for solving NP-hard problems to near optimality. Since the parameters of heuristi...
متن کاملE cient On-Line Call Control Algorithms
We study the problem of on-line call control, i.e., the problem of accepting or rejecting an incoming call without knowledge of future calls. The problem is part of the more general problem of bandwidth allocation and management. Intuition suggests that knowledge of future call arrivals can be crucial to the performance of the system. In this paper, however, we present deterministic on-line cal...
متن کاملEecient On-line Call Control Algorithms
We study the problem of on-line call control in a communications network, i.e., the problem of accepting or rejecting an incoming call (a request for a connection between two points in a network) without having the knowledge of future calls. The problem is a part of the more general problem of bandwidth allocation and management. Intuition suggests that knowledge of future call arrivals can be ...
متن کاملOptimizing On-Line Advertising
We want to find the optimal strategy for displaying advertisements e.g. banners, videos, in given locations at given times under some realistic dynamic constraints. Our primary goal is to maximize the expected revenue in a given period of time, i.e. the total profit produced by the impressions, which depends on profit-generating events such as the impressions themselves, the ensuing clicks and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 1988
ISSN: 1474-6670
DOI: 10.1016/b978-0-08-035735-5.50017-6